Towards a General Framework for Composing Disjunctive and Iterative Macro-operators
نویسندگان
چکیده
Inducing disjunctive and iterative macro-operators from empirical problem-solving traces provides a more powerful knowledge compilation method than simple linear macro-operators. Whereas earlier work focused on when to create iterative macro-operators, this paper addresses how to form them, combining proven optimization methods such as extraction of loop invariants, with techniques for further optimizing RETEmatch efficiency. The disjunctive and iterative composition processes have been implemented in FERMI and its underlying production system language. Empirical results confirm substantial rule-match speedups and system performance improvements in different application domains.
منابع مشابه
Fast Planning with Iterative Macros
Research on macro-operators has a long history in planning and other search applications. There has been a revival of interest in this topic, leading to systems that successfully combine macrooperators with current state-of-the-art planning approaches based on heuristic search. However, research is still necessary to make macros become a standard, widely-used enhancement of search algorithms. T...
متن کاملSome iterative method for finding a common zero of a finite family of accretive operators in Banach spaces
The purpose of this paper is to introduce a new mapping for a finite family of accretive operators and introduce an iterative algorithm for finding a common zero of a finite family of accretive operators in a real reflexive strictly convex Banach space which has a uniformly G^ateaux differentiable norm and admits the duality mapping $j_{varphi}$, where $varphi$ is a gauge function ...
متن کاملOn new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces
In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.
متن کاملCompositionality for quantitative specifications
We provide a framework for compositional and iterative design and verification of systems with quantitative information, such as rewards, time or energy. It is based on disjunctive modal transition systems where we allow actions to bear various types of quantitative information. Throughout the design process the actions can be further refined and the information made more precise. We show how t...
متن کاملSpeculative Constraint Processing with Iterative Revision for Disjunctive Answers
In multi-agents systems, incompleteness, due to either communication failure or response delay, is a major problem to handle. To face incompleteness, frameworks for speculative computation were proposed (see [5, 6, 4]). The idea developed in such frameworks is to allow the asking agent, while waiting for slave agents to reply, to reason using default belief until replies are sent. In [6] in par...
متن کامل